Probabilistic arithmetic. I. Numerical methods for calculating convolutions and dependency bounds
نویسندگان
چکیده
Probabilistic arithmetic involves the calculation of the distribution of arithmetic functions of random variables. This work on probabilistic arithmetic began as an investigation into the possibility o f adapting existing numerical procedures (developal for fixed numbers) to handle random variables (by replacing the basic operations of arithmetic by the appropriate convolutions). The general idea is similar to interval arithmetic and fuzzy arithmetic. In this paper we present a new and general numerical method for calculating the appropriate convolutions of a wide range of probability distributions. An important feature of the method is the manner in which the probability distributions are represented. We use lower and upper discrete approximations to the quantile function (the quasi-inverse of the distribution function). This results in any representation error being always contained within the lower and upper bounds. This method of representation has advantages over other methods previously proposed. The representation fits in well with the idea of dependency bounds. Stochastic dependencies that arise within the course of a sequence of operations on random variables are the severest limit to the simple application of convolution algorithms to the formation of a general probabilistic arithmetic. We examine this dependency error and show how dependency bounds are a possible means of reducing its effect. Dependency bounds are lower and upper bounds on the distribution of a function of random variables that contain the true distribution even when nothing is known of the dependence of the random variables. They are based on the P~dchet inequalities for the joint distribution of a set o f random variables in terms of their marginal distributions. We show how the dependency bounds can be calculated numerically using our numerical representation of probability distributions. Examples of the methods developed are presented, *This work was supported by a grant through the Australian Research Grants Scheme and a Commonwealth Postgraduate Research Award. Address correspondence to: Robert C. WUliamson, Department of Systems Engineering, Australian National University, Canberra, 2601, Australia. International Journal of Approximate Reasoning 1990; 4:89-158 1990 Elsevier Science Publishin 8 Co., Inc. 655 Avenue of the Americas, New York, NY 10010 0888-613X/90/$3.50 89 90 Robert C. Williamson and Tom Downs and relationships with other work on numerically handling uncertainties are briefly described.
منابع مشابه
Probabilistic Arithmetic
This thesis develops the idea of probabilistic arithmetic. The aim is to replace arithmetic operations on numbers with arithmetic operations on random variables. Specifically, we are interested in numerical methods of calculating convolutions of probability distributions. The long-term goal is to be able to handle random prob lems (such as the determination of the distribution of the roots of ...
متن کاملAugust,1989. Statement of Originality Tothebestofthecandidate'sknowledgeandbelief,thematerialpresentedinthis
This thesis develops the idea of probabilistic arithmetic The aim is to replace arithmetic operations on numbers with arithmetic operations on random variables Speci cally we are interested in numerical methods of calculating convolutions of probability distributions The long term goal is to be able to handle random prob lems such as the determination of the distribution of the roots of random ...
متن کاملA Probabilistic Technique for Finding Almost-periods in Additive Combinatorics
We introduce a new probabilistic technique for finding ‘almost-periods’ of convolutions of subsets of finite groups. This allows us to give probabilistic proofs of two classical results in additive combinatorics: Roth’s theorem on three-term arithmetic progressions and the existence of long arithmetic progressions in sumsets A+B in Zp. The bounds we obtain for these results are not the best one...
متن کاملOn Taylor Model Based Integration of ODEs
The numerical solution of initial value problems (IVPs) for ODEs is one of the fundamental problems in computation. Today, there are many well-established algorithms for solving IVPs. However, traditional integration methods usually provide only approximate values for the solution. Precise error bounds are rarely available. The error estimates, which are sometimes delivered, are not guaranteed ...
متن کاملOn Third Geometric-Arithmetic Index of Graphs
Continuing the work K. C. Das, I. Gutman, B. Furtula, On second geometric-arithmetic index of graphs, Iran. J. Math Chem., 1(2) (2010) 17-28, in this paper we present lower and upper bounds on the third geometric-arithmetic index GA3 and characterize the extremal graphs. Moreover, we give Nordhaus-Gaddum-type result for GA3.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 4 شماره
صفحات -
تاریخ انتشار 1990